Free Adjunction of Morphisms
نویسندگان
چکیده
We develop a general setting for the treatment of extensions of categories by means of freely adjoined morphisms. To this end, we study what we call composition graphs, i.e. large graphs with a partial binary operation on which we impose only rudimentary requirements. The quasicategory thus obtained contains the quasicategory of all categories as a full reflective subquasicategory; we characterize composition graphs for which this reflexion is of a particularly simple nature. This leads to the concept of semicategory; we apply semicategories to solve characterization problems concerning absolutely initial sources, absolute monosources and potential sections. For instance, we show that in any category, the absolutely initial sources are precisely the sources that contain a section.
منابع مشابه
Coalgebra-to-Algebra Morphisms
Given a coalgebra p for HG, an algebra s for GH and the obvious notion of morphism from coalgebra to algebra, we observe that morphisms from Gp to s correspond to morphisms from p to Hs in the manner of an adjunction even when there is no adjunction between G and H. This appears to be one of the basic phenomena underlying the transport of special algebras. A proof of Freyd’s Iterated Square The...
متن کاملMonads on Composition Graphs
Collections of objects and morphisms that fail to form categories inas-much as the expected composites of two morphisms need not always be deened have been introduced in 14, 15] under the name composition graphs. In 14, 16], notions of adjunction and weak adjunction for composition graphs have been proposed. Building on these deenitions, we now introduce a concept of monads for composition grap...
متن کاملSeparable Morphisms of Simplicial Sets
We show that the class of separable morphisms in the sense of G. Janelidze and W. Tholen in the case of Galois structure of second order coverings of simplicial sets due to R. Brown and G. Janelidze coincides with the class of covering maps of simplicial sets. Introduction Separable morphisms were introduced in [3] by A. Carboni and G. Janelidze for lextensive categories. In the way of [3] one ...
متن کاملLocalic Databases
1.2. Morphisms between locales. We introduced the above ideas using a map of simplicial sets f : X → Y , but in actuality the definitions of F∗ and F∗ work whenever F is a open morphism of locales, as we shall soon see. To get to that point, however, it is best to start all over, by taking X and Y to be arbitrary locales and considering an arbitrary adjunction f∗ : Y //X : f∗ oo as a morphism F...
متن کاملAdjoint Logic with a 2-Category of Modes
We generalize the adjoint logics of Benton and Wadler (1996) and Reed (2009) to allow multiple different adjunctions between the same categories. This provides insight into the structural proof theory of cohesive homotopy type theory, which integrates the synthetic homotopy theory of homotopy type theory with the synthetic topology of Lawvere’s axiomatic cohesion. Reed’s calculus is parametrize...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Categorical Structures
دوره 8 شماره
صفحات -
تاریخ انتشار 2000